SQG-Differential Evolution for Difficult Optimization Problems under a Tight Function Evaluation Budget
نویسندگان
چکیده
In the context of industrial engineering it is important to integrate efficient computational optimization methods in the product development process. Some of the most challenging simulation based engineering design optimization problems are characterized by: a large number of design variables, the absence of analytical gradient information, highly non-linear objectives and a limited function evaluation budget. Although a huge variety of different optimization algorithms is available, the development and selection of efficient algorithms for problems with these industrial relevant characteristics, remains a challenge. In this communication a hybrid variant of Differential Evolution (DE) is introduced which combines aspects of Stochastic Quasi-Gradient (SQG) methods within the framework of DE, in order to improve optimization efficiency on problems with the previously mentioned characteristics. The performance of the resulting method is compared with other state-of-the-art DE variants on 25 commonly used test functions, under tight function evaluation budget constraints of 1000 evaluations. The experimental results indicate that the proposed method performs particularly good on the “difficult” (high dimensional, multi-modal, inseparable) test functions. The operations used in the proposed mutation scheme, are computationally inexpensive, and can be easily implemented in existing differential evolution or other optimization algorithms by a few lines of program code as an non-invasive optional setting. Besides the applicability of the presented algorithm by itself, the described concepts can serve as a useful and interesting addition to the algorithmic operators in the frameworks of heuristics and evolutionary optimization and computing.
منابع مشابه
Optimization of the Prismatic Core Sandwich Panel under Buckling Load and Yield Stress Constraints using an Improved Constrained Differential Evolution Algorithm
In this study, weight optimization of the prismatic core sandwich panel under transverse and longitudinal loadings has been independently investigated. To solve the optimization problems corresponding to the mentioned loadings, a new Improved Constrained Differential Evolution (ICDE) algorithm based on the multi-objective constraint handling method is implemented. The constraints of the problem...
متن کاملWell Placement Optimization Using Differential Evolution Algorithm
Determining the optimal location of wells with the aid of an automated search algorithm is a significant and difficult step in the reservoir development process. It is a computationally intensive task due to the large number of simulation runs required. Therefore,the key issue to such automatic optimization is development of algorithms that can find acceptable solutions with a minimum numbe...
متن کاملFuzzy logic controlled differential evolution to solve economic load dispatch problems
In recent years, soft computing methods have generated a large research interest. The synthesis of the fuzzy logic and the evolutionary algorithms is one of these methods. A particular evolutionary algorithm (EA) is differential evolution (DE). As for any EA, DE algorithm also requires parameters tuning to achieve desirable performance. In this paper tuning the perturbation factor vector of DE ...
متن کاملFuzzy logic controlled differential evolution to solve economic load dispatch problems
In recent years, soft computing methods have generated a large research interest. The synthesis of the fuzzy logic and the evolutionary algorithms is one of these methods. A particular evolutionary algorithm (EA) is differential evolution (DE). As for any EA, DE algorithm also requires parameters tuning to achieve desirable performance. In this paper tuning the perturbation factor vector of DE ...
متن کاملMultiobjective Optimization on a Budget of 250 Evaluations
In engineering and other ‘real-world’ applications, multiobjective optimization problems must frequently be tackled on a tight evaluation budget — tens or hundreds of function evaluations, rather than thousands. In this paper, we investigate two algorithms that use advanced initialization and search strategies to operate better under these conditions. The first algorithm, Bin MSOPS, uses a bina...
متن کامل